class Solution {
public:
    vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
        int Min = INT_MAX;
        sort(arr.begin(), arr.end());
        vector<vector<int>> ret;
        int n = arr.size();
        for (int i = 1; i < n; i++)
        {
            Min = min(Min, abs(arr[i] - arr[i - 1]));
        }
        for (int i = 0; i < arr.size() - 1; i++)
        {
            vector<int> v;
            for (int j = i + 1; j < arr.size(); j++)
            {
                if (arr[i] < arr[j] && arr[j] - arr[i] == Min)
                {
                    v.push_back(arr[i]);
                    v.push_back(arr[j]);
                    ret.push_back(v);
                }
            }

        }
        return ret;
    }
};